On multiplicative sequences

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multiplicative Structures on Homotopy Spectral Sequences Ii

This short paper is a companion to [D1]. Here the main results of that paper are used to establish multiplicative structures on a few standard spectral sequences. The applications consist of (a) applying [D1, Theorem 6.1] to obtain a pairing of spectral sequences, and (b) identifying the pairing on the E1or E2-term with something familiar, like a pairing of singular cohomology groups. Most of t...

متن کامل

Multiplicative Structures on Homotopy Spectral Sequences, Part I

A tower of homotopy fiber sequences gives rise to a spectral sequence on homotopy groups. In modern times such towers are ubiquitous, and most of the familiar spectral sequences in topology can be constructed in this way. A pairing of towers W∗ ∧X∗ → Y∗ consists of maps Wm ∧Xn → Ym+n which commute (on-the-nose) with the maps in the towers. It is a piece of folklore that a pairing of towers give...

متن کامل

Note on the Riemann-hurwitz Type Formula for Multiplicative Sequences

We give a formula of the Riemann-Hurwitz type for classes defined by multiplicative sequences as corollaries of the Chern number formula for ramified coverings. 1. 1.1. In the classical results on Riemann surfaces, we have the Riemann-Hurwitz formula which relates the topological Euler numbers of the covering space and base space. The difference of the Euler numbers can be expressed by local re...

متن کامل

On strongly 2-multiplicative graphs

In this paper we obtain an upper bound and also a lower bound for maximum edges of strongly 2 multiplicative graphs of order n. Also we prove that triangular ladder the graph obtained by duplication of an arbitrary edge by a new vertex in path and the graphobtained by duplicating all vertices by new edges in a path and some other graphs are strongly 2 multiplicative

متن کامل

Multiplicative Character Sums of Recurring Sequences with Rédei Functions

We prove a new bound for multiplicative character sums of nonlinear recurring sequences with Rédei functions over a finite field of prime order. This result is motivated by earlier results on nonlinear recurring sequences and their application to the distribution of powers and primitive elements. The new bound is much stronger than the bound known for general nonlinear recurring sequences.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Colloquium Mathematicum

سال: 1960

ISSN: 0010-1354,1730-6302

DOI: 10.4064/cm-7-2-265-268